|
Visibility is a mathematical abstraction of the real-life notion of visibility. Given a set of obstacles in the Euclidean space, two points in the space are said to be visible to each other, if the line segment that joins them does not intersect any obstacles. (In the Earth's atmosphere light follows a slightly curved path that isn't perfectly predictable, complicating the calculation of actual visibility.) Computation of visibility is among the basic problems in computational geometry and has applications in computer graphics, motion planning, and other areas. ==Concepts and problems== *Point visibility *Edge visibility〔D. Avis and G. T. Toussaint, "An optimal algorithm for determining the visibility of a polygon from an edge," ''IEEE Transactions Computers'', vol. C-30, No. 12, December 1981, pp. 910-914.〕〔E. Roth, G. Panin and A. Knoll, "Sampling feature points for contour tracking with graphics hardware", "In International Workshop on Vision, Modeling and Visualization (VMV)", Konstanz, Germany, October 2008.〕 *Visibility polygon *Weak visibility *Art gallery problem or museum problem *Visibility graph * *Visibility graph of vertical line segments *Watchman route problem *Computer graphics applications: * *Hidden surface determination * *Hidden line removal * *z-buffering * *portal engine *Star-shaped polygon * *Kernel of a polygon *Isovist *Viewshed *Zone of Visual Influence 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Visibility (geometry)」の詳細全文を読む スポンサード リンク
|